Hiding Sensitive Frequent Itemsets by a Border-Based Approach
نویسندگان
چکیده
منابع مشابه
Hiding Sensitive Frequent Itemsets by a Border-Based Approach
Nowadays, sharing data among organizations is often required during the business collaboration. Data mining technology has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive k...
متن کاملA Greedy-based Approach for Hiding Sensitive Itemsets by Transaction Insertion
Data mining technology is designed to derive useful knowledge from large database, which is used to aid decision making. The process of data collection and dissemination may, however, causes privacy concerns. Sensitive or personal information and knowledge of individuals, industries and organizations must be kept private before they are publicly shared or published. Thus, privacy-preserving dat...
متن کاملDiscovery of Frequent Itemsets: Frequent Item Tree-Based Approach
Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of data, computational and I/O cost. Additionally, the recursive mining process to mine these structures is also too voracious in memory resource...
متن کاملFast Discovery of Frequent Itemsets: a Cubic Structure-Based Approach
Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. The different existing frequent pattern discovering algorithms suffer from various problems regarding the computational and I/O cost, and memory requirements when mining large amount of data. In this paper a novel approach is introduced for solving the aforementioned issues. The co...
متن کاملA New Approach to Mine Frequent Itemsets
Mining frequent patterns in transaction databases and many other kinds of databases has been studied popularly in data mining research. Methods for efficient mining of frequent itemsets have been studied extensively by many researchers. However, the previously proposed methods still encounter some performance bottlenecks when mining databases with different data characteristics. The time requir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing Science and Engineering
سال: 2007
ISSN: 1976-4677
DOI: 10.5626/jcse.2007.1.1.074